Embedding path designs into a maximum packing of K n with 4 - cycles ∗ Gaetano Quattrocchi
نویسنده
چکیده
A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V is the vertex set of the complete graph Kn, C is a collection of edge-disjoint copies of C4, and L is the set of edges not belonging to a block of C. The number n is called the order of the packing and the set of unused edges L is called the leave. If C is as large as possible, then (V, C, L) is called a maximum packing MPC(n, 4, 1). We say that a path design P (v, k, 1) (W,P) is embedded into an MPC(n, 4, 1) (V, C, L) if there is an injective mapping f : P → C such that P is a subgraph of f (P ) for every P ∈ P. Let SP(n, 4, k) denote the set of the integers v such that there exists an MPC(n, 4, 1) which embeds a P (v, k, 1). If n ≡ 1 (mod 8) then an MPC(n, 4, 1) coincides with a 4-cycle system of order n and the related embedding problem is completely solved by Quattrocchi, Discrete Math., 255 (2002). The aim of the present paper is to determine SP(n, 4, k) for every integer n 6≡ 1 (mod 8), n ≥ 4. AMS classification: 05B05.
منابع مشابه
Embedding handcuffed designs into a maximum packing of the complete graph with 4-cycles
A packing of Kn with copies of C4 (the cycle of length 4), is an ordered triple (V, C, L), where V is the vertex set of the complete graph Kn, C is a collection of edge-disjoint copies of C4, and L is the set of edges not belonging to a block of C. The number n is called the order of the packing and the set of unused edges L is called the leave. If C is as large as possible, then (V, C, L) is c...
متن کاملOn arcs in path designs of block size four
For each admissible v, we exhibit a path design P (v, 4, 1) with a spanning set of minimum cardinality and a P (v, 4, 1) with a scattering set of maximum
متن کاملPath designs P(v, 3, 1) and P(v, 4, 1) with ovals
In this paper we give a complete solution of the problem of path designs P(v,3,l) and P(v,4,1) having an oval.
متن کاملBlocking sets in balanced path designs
Let k ~ 3. For each admissible v, we determine the set BS1i ( v, k, 1) of integers x such that there exists a balanced path design H ( v, k, 1) with a blocking set of cardinality x.
متن کاملEmbeddings of Simple Maximum Packings of triples with 2 Even
Let MPT (v, 2) denote a maximum packing of triples of order v and index 2. An MPT (v, 2) is called simple if it contains no repeated triples. It is proved in this paper that for v > 2 and any even 2, the necessary and sufficient condition for the embedding of a simple MPT(v,2) in a simple MPT(u,).) is u >/2v + 1.
متن کامل